Coreduction Homology Algorithm
نویسندگان
چکیده
منابع مشابه
Coreduction Homology Algorithm
A new reduction algorithm for the efficient computation of the homology of cubical sets and polotypes, particularly strong for low dimensional sets embedded in high dimensions, is presented. The algorithm runs in linear time. The paper presents the theoretical background of the algorithm, the algorithm itself, experimental results based on an implementation for cubical sets as well as some theo...
متن کاملCoreduction Homology Algorithm for Regular CW-Complexes
In this paper we present a new algorithm for computing the homology of regular CW-complexes. This algorithm is based on the coreduction algorithm due to Mrozek and Batko and consists essentially of a geometric preprocessing algorithm for the standard chain complex generated by a CW-complex. By employing the concept of S-complexes the original chain complex can — in all known practical cases — b...
متن کاملCoreduction homology algorithm for inclusions and persistent homology
We present an algorithm for computing the homology of inclusion maps which is based on the idea of coreductions and leads to significant speed improvements over current algorithms. It is shown that this algorithm can be extended to compute both persistent homology and an extension of the persistence concept to two-sided filtrations. In addition to describing the theoretical background, we prese...
متن کاملAn Algorithm for Low Dimensional Group Homology
Given a finitely presented group G, Hopf’s formula expresses the second integral homology of G in terms of generators and relators. We give an algorithm that exploits Hopf’s formula to estimate H2(G; k), with coefficients in a finite field k, and give examples using G = SL2 over specific rings of integers. These examples are related to a conjecture of Quillen.
متن کاملHomology algorithm based on acyclic subspace
We present a new reduction algorithm for the efficient computation of the homology of a cubical set. The algorithm is based on constructing a possibly large acyclic subspace, and then computing the relative homology instead of the plain homology. We show that the construction of acyclic subspace may be performed in linear time. This significantly reduces the amount of data that needs to be proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2008
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9073-y